Continuous Lattices of Maps between T 0 Spaces 1 Grzegorz Bancerek University of Białystok
نویسنده
چکیده
The articles [32], [15], [38], [33], [19], [39], [13], [40], [18], [12], [16], [1], [10], [30], [2], [35], [27], [28], [29], [37], [3], [14], [31], [24], [11], [42], [34], [4], [5], [6], [22], [41], [17], [8], [7], [25], [36], [23], [21], [26], and [9] provide the notation and terminology for this paper. Let I be a set and let J be a relational structure yielding many sorted set indexed by I. We introduce I -prodPOS J as a synonym of ∏J. Let I be a set and let J be a relational structure yielding nonempty many sorted set indexed by I. Observe that I -prodPOS J is constituted functions. Let I be a set and let J be a topological space yielding nonempty many sorted set indexed by I. We introduce I -prodTOP J as a synonym of ∏J. Let X , Y be non empty topological spaces. The functor [X → Y ] yields a non empty strict relational structure and is defined as follows:
منابع مشابه
Categorial Background for Duality Theory
In the paper, we develop the notation of lattice-wise categories as concrete categories (see [10]) of lattices. Namely, the categories based on [24] with lattices as objects and at least monotone maps between them as morphisms. As examples, we introduce the categories UPS, CONT, and ALG with complete, continuous, and algebraic lattices, respectively, as objects and directed suprema preserving m...
متن کاملContinuous Lattices between T 0 Spaces 1 Grzegorz Bancerek
The terminology and notation used in this paper have been introduced in the following articles: [29], [16], [12], [13], [11], [1], [2], [32], [18], [30], [24], [25], [26], [27], [3], [9], [34], [35], [33], [28], [15], [21], [37], [10], [31], [20], [23], [5], [14], [6], [22], [8], [4], [19], [36], and [7]. Let I be a set and let J be a relational structure yielding many sorted set indexed by I. ...
متن کاملAbstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland Summary. Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, ChurchRosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
متن کاملConcrete Categories
In the paper, we develop the notation of duality and equivalence of categories and concrete categories based on [22]. The development was motivated by the duality theory for continuous lattices (see [10, p. 189]), where we need to cope with concrete categories of lattices and maps preserving their properties. For example, the category UPS of complete lattices and directed suprema preserving map...
متن کاملDirected Sets , Nets , Ideals , Filters , and Maps 1
Notation and facts necessary to start with the formalization of continuous lattices according to [8] are introduced. The article contains among other things, the definition of directed and filtered subsets of a poset (see 1.1 in [8, p. 2]), the definition of nets on the poset (see 1.2 in [8, p. 2]), the definition of ideals and filters and the definition of maps preserving arbitrary and directe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999